Hypotheses testing on infinite random graphs
نویسنده
چکیده
Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a criterion for the existence of a consistent test for complex hypotheses is presented, generalizing the corresponding results on time series. As an application, it is shown how one can test that a tree has the Markov property, or, more generally, to estimate its memory.
منابع مشابه
A Regularity Lemma for Bounded Degree Graphs and Its Applications: Parameter Testing and Infinite Volume Limits
We prove a regularity lemma for bounded degree graphs of subexponential growth. As an application we show that the edit-distance from a hereditary property is testable via random samplings in the graph category above. Using the regularity lemma we also prove the existence of the infinite volume limit of some log-partition functions as well as the nonrandomness of the integrated density of state...
متن کاملLINEAR HYPOTHESIS TESTING USING DLR METRIC
Several practical problems of hypotheses testing can be under a general linear model analysis of variance which would be examined. In analysis of variance, when the response random variable Y , has linear relationship with several random variables X, another important model as analysis of covariance can be used. In this paper, assuming that Y is fuzzy and using DLR metric, a method for testing ...
متن کاملHypergroups derived from random walks on some infinite graphs
Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of finite graphs. In this article, we reveal that his method is applicable to a random walk on a certain kind of infinite graphs. Moreover, we make some observations of finite or infinite graphs on which a random walk produces a hermitian discrete hypergroup.
متن کاملCycle Density in Infinite Ramanujan Graphs
We introduce a technique using non-backtracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of non-trivial cycles in simple random walk to that in non-backtracking random walk. We apply this to infinite Ramanujan graphs, which are regular graphs whose spectral radius equals that of the tree of the same degree. Kesten showed that the o...
متن کاملRandom Walks on Directed Covers of Graphs
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates do not longer coincide in general. Furthermore, the behaviour of random walks on directed covers of infi...
متن کامل